This paper proposes an approach for estimating the least-cost transition firing sequence(s) that matches (match) the observation of a sequence of labels produced by transition activity in a given labeled Petri net. Each ...

Given a labeled Petri net, possibly with silent (unobservable) transitions, we are interested in performing marking estimation in a probabilistic setting. We assume a known initial marking or a known finite set of initial ...